Simple Constructions of Almost k-wise Independent Random Variables
نویسندگان
چکیده
منابع مشابه
Simple Constructions of Almost k-Wise Independent Random Variables
We present three alternative simple constructions of small proba. bility spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is (2 +o(l»(loglog n + log k + log ~), where f is the statistical difference between the distribution induced on any k bit locations and the uni form distribution. This is asymptotically comparable...
متن کاملA Simple Construction of Almost k-wise Independent Random Variables
We present a simple construction of a small probability space on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is O(log log n + k + log ~), where e is the statistical difference between of the distribution induced on any k bit locations and the uniform distribution. This is asymptotically comparable to the construction recentl...
متن کاملAlmost k-wise Independent Variables
We will now consider the problem of creating a set of bitstrings such that the bits are almost k-wise independent. Our method consists of two steps. In the first step we create a set of bitstrings such that parity on every fixed index set is almost even. In the second step we present a method to convert such a set into a set where the bits are almost k-wise independent. For presentational reaso...
متن کاملOBDDs and (Almost) $k$-wise Independent Random Variables
OBDD-based graph algorithms deal with the characteristic function of the edge set E of a graph G = (V,E) which is represented by an OBDD and solve optimization problems by mainly using functional operations. We present an OBDD-based algorithm which uses randomization for the first time. In particular, we give a maximal matching algorithm with O(log |V |) functional operations in expectation. Th...
متن کاملOn Construction of k-Wise Independent Random Variables
A 0-1 probability space is a probability space ((; 2 ; P), where the sample space f0;1g n for some n. A probability space is k-wise independent if, when Yi is deened to be the ith coordinate of the random n-vector, then any subset of k of the Yi's is (mutually) independent, and it is said to be a probability space for p1; p2; :::;pn if PYi = 1] = pi. We study constructions of k-wise independent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 1992
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.3240030308